The reciprocal sum of divisors of Mersenne numbers
نویسندگان
چکیده
We investigate various questions concerning the reciprocal sum of divisors, or prime Mersenne numbers $2^n-1$. Conditional on Elliott-Halberstam Conjecture and Generalized Riemann Hypothesis, we determine $\max_{n\le x} \sum_{p \mid 2^n-1} 1/p$ to within $o(1)$ \sum_{d\mid 2^n-1}1/d$ a factor $1+o(1)$, as $x\to\infty$. This refines, conditionally, earlier estimates Erd?s Erd?s-Kiss-Pomerance. Conditionally (only) GRH, also $\sum 1/d$ $1+o(1)$ where $d$ runs over all dividing $2^n-1$ for some $n\le x$. conditionally confirms conjecture Pomerance answers question Murty-Rosen-Silverman. Finally, show that both $\sum_{p\mid $\sum_{d\mid admit continuous distribution functions in sense probabilistic number theory.
منابع مشابه
Divisors of Mersenne Numbers By Samuel
We add to the heuristic and empirical evidence for a conjecture of Gillies about the distribution of the prime divisors of Mersenne numbers. We list some large prime divisors of Mersenne numbers Mp in the range 17000 < p < 105.
متن کاملSums of Prime Divisors and Mersenne Numbers
The study of the function β(n) originated in the paper of Nelson, Penney, and Pomerance [7], where the question was raised as to whether the set of Ruth-Aaron numbers (i.e., natural numbers n for which β(n) = β(n+ 1)) has zero density in the set of all positive integers. This question was answered in the affirmative by Erdős and Pomerance [5], and the main result of [5] was later improved by Po...
متن کاملThe Reciprocal Sum of the Amicable Numbers
In this paper, we improve on several earlier attempts to show that the reciprocal sum of the amicable numbers is small, showing this sum is < 215.
متن کاملOn the sum of reciprocal Tribonacci numbers
In this paper we consider infinite sums derived from the reciprocals of the Fibonacci numbers, and infinite sums derived from the reciprocals of the square of the Fibonacci numbers. Applying the floor function to the reciprocals of these sums, we obtain equalities that involve the Fibonacci numbers.
متن کاملGeneralised Mersenne Numbers Revisited
Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attractive choice for modular multiplication implementation. However, the issue of residue multiplication efficiency seems to have been overlooked....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2021
ISSN: ['0065-1036', '1730-6264']
DOI: https://doi.org/10.4064/aa200602-11-9